The Weighted Spectrum of the Universal Cover and an Alon-boppana Result for the Normalized Laplacian
نویسنده
چکیده
We provide a lower bound for the spectral radius of the universal cover of irregular graphs in the presence of symmetric edge weights. We use this bound to derive an Alon-Boppana type bound for the second eigenvalue of the normalized Laplacian.
منابع مشابه
An Alon-Boppana Type Bound for Weighted Graphs and Lowerbounds for Spectral Sparsification
We prove the following Alon-Boppana type theorem for general (not necessarily regular) weighted graphs: if G is an n-node weighted undirected graph of average combinatorial degree d (that is, G has dn/2 edges) and girth g > 2d + 1, and if λ1 ≤ λ2 ≤ · · ·λn are the eigenvalues of the (non-normalized) Laplacian of G, then λn λ2 ≥ 1 + 4 √ d −O ( 1 d 5 8 ) (The Alon-Boppana theorem implies that if ...
متن کاملNormalized laplacian spectrum of two new types of join graphs
Let $G$ be a graph without an isolated vertex, the normalized Laplacian matrix $tilde{mathcal{L}}(G)$ is defined as $tilde{mathcal{L}}(G)=mathcal{D}^{-frac{1}{2}}mathcal{L}(G)mathcal{D}^{-frac{1}{2}}$, where $mathcal{D}$ is a diagonal matrix whose entries are degree of vertices of $G$. The eigenvalues of $tilde{mathcal{L}}(G)$ are called as the normalized Laplacian eigenva...
متن کاملA Generalized Alon-Boppana Bound and Weak Ramanujan Graphs
A basic eigenvalue bound due to Alon and Boppana holds only for regular graphs. In this paper we give a generalized Alon-Boppana bound for eigenvalues of graphs that are not required to be regular. We show that a graph G with diameter k and vertex set V , the smallest nontrivial eigenvalue λ1 of the normalized Laplacian L satisfies λ1 6 1− σ ( 1− c k ) for some constant c where σ = 2 ∑ v dv √ d...
متن کاملA generalized Alon-Boppana bound and weak Ramanujan graphs
A basic eigenvalue bound due to Alon and Boppana holds only for regular graphs. In this paper we give a generalized Alon-Boppana bound for eigenvalues of graphs that are not required to be regular. We show that a graph G with diameter k and vertex set V , the smallest nontrivial eigenvalue λ1 of the normalized Laplacian L satisfies λ1 6 1− σ ( 1− c k ) for some constant c where σ = 2 ∑ v dv √ d...
متن کاملOptimum decoder for multiplicative spread spectrum image watermarking with Laplacian modeling
This paper investigates the multiplicative spread spectrum watermarking method for the image. The information bit is spreaded into middle-frequency Discrete Cosine Transform (DCT) coefficients of each block of an image using a generated pseudo-random sequence. Unlike the conventional signal modeling, we suppose that both signal and noise are distributed with Laplacian distribution, because the ...
متن کامل